Epigraph projections for fast general convex programming
نویسندگان
چکیده
This paper develops an approach for efficiently solving general convex optimization problems specified as disciplined convex programs (DCP), a common general-purpose modeling framework. Specifically we develop an algorithm based upon fast epigraph projections, projections onto the epigraph of a convex function, an approach closely linked to proximal operator methods. We show that by using these operators, we can solve any disciplined convex program without transforming the problem to a standard cone form, as is done by current DCP libraries. We then develop a large library of efficient epigraph projection operators, mirroring and extending work on fast proximal algorithms, for many common convex functions. Finally, we evaluate the performance of the algorithm, and show it often achieves order of magnitude speedups over existing general-purpose optimization solvers.
منابع مشابه
Epigraph proximal algorithms for general convex programming
This work aims at partially bridging the gap between (generic but slow) “generalpurpose” convex solvers and (fast but constricted) “specialized” solvers. We develop the Epsilon system, a solver capable of handling general convex problems (inputs are specified directly as disciplined convex programs); however, instead of transforming these problems to cone form, the compiler transforms them to a...
متن کاملSignal Reconstruction Framework Based On Projections Onto Epigraph Set Of A Convex Cost Function (PESC)
A new signal processing framework based on the projections onto convex sets (POCS) is developed for solving convex optimization problems. The dimension of the minimization problem is lifted by one and the convex sets corresponding to the epigraph of the cost function are defined. If the cost function is a convex function in RN the corresponding epigraph set is also a convex set in RN+1. The ite...
متن کاملProjection Onto Convex Sets ( POCS ) Based Signal Reconstruction Framework with an associated cost function
A new signal processing framework based on the projections onto convex sets (POCS) is developed for solving convex optimization problems. The dimension of the minimization problem is lifted by one and the convex sets corresponding to the epigraph of the cost function are defined. If the cost function is a convex function in RN the corresponding epigraph set is also a convex set in RN+1. The ite...
متن کاملProximal point algorithm, Douglas–Rachford algorithm and alternating projections: a case study
Many iterative methods for solving optimization or feasibility problems have been invented, and often convergence of the iterates to some solution is proven. Under favourable conditions, one might have additional bounds on the distance of the iterate to the solution leading thus to worst case estimates, i.e., how fast the algorithm must converge. Exact convergence estimates are typically hard t...
متن کاملHölder regularity for a classical problem of the calculus of variations
Let R be bounded, open and convex. Let F W R ! R be convex, coercive of order p > 1 and such that the diameters of the projections of the faces of the epigraph of F are uniformly bounded. Then every minimizer of Z F.rv.x// dx; v 2 CW 1;1 0 .;R/; is Hölder continuous in of order p 1 nCp 1 whenever is Lipschitz on @. A similar result for non convex Lagrangians that admit a minimizer follows.
متن کامل